Improving The Scalability by Contact Information Compression in Routing
نویسندگان
چکیده
منابع مشابه
Improving The Scalability By Contact Information Compression In Routing
The existence of reduced scalability and delivery leads to the development of scalable routing by contact information compression. The previous work dealt with the result of consistent analysis in the performance of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with decreases in the routing performance. This paper focuses on improving the scalabili...
متن کاملImproving The Scalability By Contact Information Compression In Routing
The existence of reduced scalability and delivery leads to the development of scalable routing by contact information compression. The previous work dealt with the result of consistent analysis in the performance of DTN hierarchical routing (DHR). It increases as the source to destination distance increases with decreases in the routing performance. This paper focuses on improving the scalabili...
متن کاملOn The Scalability of Sensor Network Routing and Compression Algorithms
Recent advances in sensor networks have developed routing algorithms and compression and aggregation schemes that allow these networks to use their limited resources, particularly power, most ef?ciently. As sensor networks mature and sensor nodes become cheaper, deployed sensor networks will feature more nodes. This work examines the scalability behavior of routing and compression algorithms as...
متن کاملScalability Techniques in QoS Routing
One barrier to deployment of large-scale QoS networks is scalability of QoS routing. Two major sources of overhead incurred by QoS routing are frequent network state updates and QoS-based path computation. Researchers have proposed an impressive array of techniques to reduce these overheads. The goal of this paper is to survey scalability techniques, in the context of a taxonomy intended to ill...
متن کاملRouting and Data Compression in Sensor Networks: Stochastic Models for Sensor Data that guarantee Scalability
In our problem setting there are N nodes vi are placed on a square grid of unit area, at random locations (xi, yi). Each vi observes a sample Si of a spatial jointly normal stochastic process which is such that the correlation between samples increases as the distance between them in the grid decreases. The samples are assumed to be temporally independent and taken at the same time instant, hen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Information Theory
سال: 2013
ISSN: 2320-8465,2319-7609
DOI: 10.5121/ijit.2014.2404